Fixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound
نویسندگان
چکیده
Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland’s utilization bound. Keywords-real-time systems; utilization bound; multiprocessor; fixed priority scheduling
منابع مشابه
New Fixed-Priority Multiprocessor Scheduling Algorithms with Liu & Layland’s Utilization Bound
In a recent work [11], we have developed an algorithm generalizing the famous Liu and Layland’s utilization bound to multiprocessor scheduling. The algorithm has the best worst-case utilization bound compared with existing algorithms. However, its average-case performance is not satisfactory as the workload of each processor is limited by Liu and Layland’s bound. In this paper, we present a new...
متن کاملThe Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough has been Liu and Layland’s utilization bound for schedulability of periodic tasks. In 2001 this bound was generalized by Abdelzaher and Lu to the aperiodic task case. In this paper, we further generalize the aperiodic ...
متن کاملFixed-Priority Multiprocessor Scheduling: Beyond Liu & Layland Utilization Bound
The increasing interests in multicores raise the question whether established results on uniprocessor scheduling, in particular, the various utilization bounds for schedulability test used in system design, can be generalized to the multiprocessor setting. Recently, this has been shown for the famous Liu and Layland utilization bound by applying novel task splitting techniques. However, paramet...
متن کاملThe utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline al...
متن کاملGlobal Priority-Driven Aperiodic Scheduling on Multiprocessors
This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0:5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number ...
متن کامل